On exponential time lower bound of Knapsack under backtracking
نویسندگان
چکیده
منابع مشابه
On exponential time lower bound of Knapsack under backtracking
M.Aleknovich et al. have recently proposed a model of algorithms, called BT model, which covers various kinds of Greedy, Backtracking and Simple Dynamic Programming algorithms and can be further divided into three kinds of fixed, adaptive and fully adaptive ones. They have proved exponential time lower bounds of exact and approximation algorithms under adaptive BT model for Knapsack problem. Th...
متن کاملImproved Exponential Time Lower Bound of Knapsack Problem Under BT Model
M.Alekhnovich et al. recently have proposed a model of algorithms, called BT model, which covers Greedy, Backtrack and Simple Dynamic Programming methods and can be further divided into fixed, adaptive and fully adaptive three kinds, and have proved exponential time lower bounds of exact and approximation algorithms under adaptive BT model for Knapsack problem which are Ω(2n/2/ √ n) = Ω(20.5n/ ...
متن کاملAn Exponential Lower Bound on the Complexity of Regularization Paths
For a variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. It has been assumed that these piecewise linear solution paths have only ...
متن کاملAn exponential lower bound for Cunningham's rule
In this paper we give an exponential lower bound for Cunningham’s least recently considered (round-robin) rule as applied to parity games, Markhov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previ...
متن کاملAn Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Haken proved that every resolution refutation of the pigeon hole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeon hole formula has an exponential size. Here we show that any arbitrary OBDD refutation of the pigeon hole formula has an exponential size, too: we prove that the size of one of the intermediate OBDDs is at least Ω(1.025).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.12.004